Increasing Symmetry Breaking by Preserving Target Symmetries

نویسندگان

  • Jimmy Ho-Man Lee
  • Jingying Li
چکیده

Breaking the exponential number of all symmetries of a constraint satisfaction problem is too costly. In practice, we often aim at breaking a subset of the symmetries efficiently, which we call target symmetries. In static symmetry breaking, the goal is to post a set of constraints to break these target symmetries in order to reduce the solution set and thus also the search space. Symmetries of a problem are all intertwined. A symmetry breaking constraint intended for a particular symmetry always breaks more than just the intended symmetry as a side-effect. Different constraints for breaking the same target symmetry can have different side-effects. Conventional wisdom suggests that we should select a symmetry breaking constraint that has more side-effects by breaking more symmetries. While this wisdom is valid in many ways, we should be careful where the side-effects take place. A symmetry is preserved by a constraint iff its symmetry classes are either entirely removed from the solution set or retained as solutions by the constraint. We give theorems and examples to demonstrate that it is beneficial to post symmetry breaking constraints that preserve the target symmetries and restrict the side-effects to only non-target symmetries as much as possible. The benefits are in terms of the number of symmetries broken and the extent to which a symmetry is broken (or eliminated), resulting in a smaller solution set and search space. Extensive experiments are also conducted to confirm the feasibility and efficiency of our proposal empirically.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lifted Symmetry Detection and Breaking for MAP Inference

Symmetry breaking is a technique for speeding up propositional satisfiability testing by adding constraints to the theory that restrict the search space while preserving satisfiability. In this work, we extend symmetry breaking to the problem of model finding in weighted and unweighted relational theories, a class of problems that includes MAP inference in Markov Logic and similar statistical-r...

متن کامل

Improvements of Symmetry Breaking During Search

Symmetries are common in many constraint problems. They can be broken statically or dynamically. The focus of this paper is the symmetry breaking during search (SBDS) method that adds conditional symmetry breaking constraints upon each backtracking during search. To trade completeness for efficiency, partial SBDS (ParSBDS) is proposed by posting only a subset of symmetries. We propose an adapta...

متن کامل

Reduction of Differential Equations by Lie Algebra of Symmetries

The paper is devoted to an application of Lie group theory to differential equations. The basic infinitesimal method for calculating symmetry group is presented, and used to determine general symmetry group of some differential equations. We include a number of important applications including integration of ordinary differential equations and finding some solutions of partial differential equa...

متن کامل

Spontaneous breaking of symmetry in Moyal spacetime with twisted Poincaré symmetry

After briefly reviewing the gauge symmetry in Moyal spacetimes, we analyse aspects of symmetry breaking within a quantisation program preserving the twisted Poincaré symmetry. We develop the LSZ approach for Moyal spacetimes and derive a mapping for scattering amplitudes on these spacetimes from the corresponding ones on the commutative spacetime. This map applies in the presence of spontaneous...

متن کامل

Symmetry-Breaking Predicates for Search Problems

Many reasoning and optimization problems exhibit symmetries. Previous work has shown how special purpose algorithms can make use of these symmetries to simplify reasoning. We present a general scheme whereby symmetries are exploited by adding \symmetry-breaking" predicates to the theory. Our approach can be used on any propo-sitional satissability problem, and can be used as a pre-processor to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012